<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    228. Summary Ranges
   </h1>
   <p>
    Given a sorted integer array without duplicates, return the summary of its ranges.
   </p>
   <p>
    <b>
     Example 1:
    </b>
   </p>
   <pre>
<b>Input:</b>  [0,1,2,4,5,7]
<b>Output:</b> ["0-&gt;2","4-&gt;5","7"]
<strong>Explanation: </strong>0,1,2 form a continuous range;&nbsp;4,5 form a continuous range.
</pre>
   <p>
    <b>
     Example 2:
    </b>
   </p>
   <pre>
<b>Input:</b>  [0,2,3,4,6,8,9]
<b>Output:</b> ["0","2-&gt;4","6","8-&gt;9"]
<strong>Explanation: </strong>2,3,4 form a continuous range;&nbsp;8,9 form a continuous range.
</pre>
  </div>
  <div>
   <h1 class="question_title">
    228. 汇总区间
   </h1>
   <p>
    给定一个无重复元素的有序整数数组，返回数组区间范围的汇总。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> [0,1,2,4,5,7]
<strong>输出:</strong> ["0-&gt;2","4-&gt;5","7"]
<strong>解释: </strong>0,1,2 可组成一个连续的区间;&nbsp;4,5 可组成一个连续的区间。</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> [0,2,3,4,6,8,9]
<strong>输出:</strong> ["0","2-&gt;4","6","8-&gt;9"]
<strong>解释: </strong>2,3,4 可组成一个连续的区间;&nbsp;8,9 可组成一个连续的区间。</pre>
  </div>
 </body>
</html>